An Improved Approach to High Level Privacy Preserving Itemset Mining

نویسندگان

  • Rajesh Kumar Boora
  • Ruchi Shukla
  • Arun Kumar Misra
چکیده

Privacy preserving association rule mining has triggered the development of many privacy-preserving data mining techniques. A large fraction of them use randomized data distortion techniques to mask the data for preserving. This paper proposes a new transaction randomization method which is a combination of the fake transaction randomization method and a new per-transaction randomization method. This method distorts the items within each transaction and ensures a higher level of data privacy in comparison to the previous approaches. The pertransaction randomization method involves a randomization function to replace the item by a random number guarantying privacy within the transaction also. A tool has also been developed to implement the proposed approach to mine frequent itemsets and association rules from the data guaranteeing the anti-monotonic property. Keywords; Data Mining, Privacy, Randomization, Association Rules.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Personalized Privacy-Preserving Frequent Itemset Mining Using Randomized Response

Frequent itemset mining is the important first step of association rule mining, which discovers interesting patterns from the massive data. There are increasing concerns about the privacy problem in the frequent itemset mining. Some works have been proposed to handle this kind of problem. In this paper, we introduce a personalized privacy problem, in which different attributes may need differen...

متن کامل

Sensitive Itemset Hiding in Multi-level Association Rule Mining

-Enormous numbers of intelligent data mining techniques are in usage to discover hidden patterns. Especially Association rule mining has a high impact on business improvement. However mining association rules at multiplelevel may lead to discovery of more specific and concrete knowledge from data. Privacy is needed in order to withstand the business competence. Now-a-days privacy preserving dat...

متن کامل

Privacy-Preserving Frequent Itemset Mining for Sparse and Dense Data

Frequent itemset mining is a task that can in turn be used for other purposes such as associative rule mining. One problem is that the data may be sensitive, and its owner may refuse to give it for analysis in plaintext. There exist many privacy-preserving solutions for frequent itemset mining, but in any case enhancing the privacy inevitably spoils the efficiency. Leaking some less sensitive i...

متن کامل

CS 730R: Topics in Data and Information Management

1. Summary. In this paper the authors propose a differentially privacy preserving algorithm for mining frequent itemset. This work differs from the other privacy preserving miners present in literature, indeed this algorithm mines the itemset by enforcing cardinality constraints on the transactions present in the dataset. In particular the authors study how the reduction the cardinality of the ...

متن کامل

Association Rule Hiding for Data Mining

The best ebooks about Association Rule Hiding For Data Mining that you can get for free here by download this Association Rule Hiding For Data Mining and save to your desktop. This ebooks is under topic such as association rule hiding for data mining springer association rule hiding for data mining advances in association rule hiding knowledge and data engineering an efficient association rule ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • CoRR

دوره abs/1001.2270  شماره 

صفحات  -

تاریخ انتشار 2010